A Line-Based Adaptive-Weight Matching Algorithm Using Loopy Belief Propagation
نویسندگان
چکیده
منابع مشابه
Loopy Belief Propagation Algorithm
check the effectiveness. In some cases, such as Dobrushin's condition is satisfied, the error bounds and the improvement procedure seem effective. Nevertheless, the region where one can obtain good bounds seems restrictive. We give some remarks in the rest of this section. First, the concept of estimates we used in this paper was developed for general Gibbs measures, so that there may be a poss...
متن کاملLoopy Belief Propagation for Bipartite Maximum Weight b-Matching
We formulate the weighted b-matching objective function as a probability distribution function and prove that belief propagation (BP) on its graphical model converges to the optimum. Standard BP on our graphical model cannot be computed in polynomial time, but we introduce an algebraic method to circumvent the combinatorial message updates. Empirically, the resulting algorithm is on average fas...
متن کاملHybrid Loopy Belief Propagation
We propose an algorithm called Hybrid Loopy Belief Propagation (HLBP), which extends the Loopy Belief Propagation (LBP) (Murphy et al., 1999) and Nonparametric Belief Propagation (NBP) (Sudderth et al., 2003) algorithms to deal with general hybrid Bayesian networks. The main idea is to represent the LBP messages with mixture of Gaussians and formulate their calculation as Monte Carlo integratio...
متن کاملFinding Deformable Shapes Using Loopy Belief Propagation
A novel deformable template is presented which detects and localizes shapes in grayscale images. The template is formulated as a Bayesian graphical model of a two-dimensional shape contour, and it is matched to the image using a variant of the belief propagation (BP) algorithm used for inference on graphical models. The algorithm can localize a target shape contour in a cluttered image and can ...
متن کاملLinear programming analysis of loopy belief propagation for weighted matching
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investigate the use of the max-product form of belief propagation for weighted matching problems on general graphs. We show that max-product converges to the correct answer if the linear programming (LP) relaxation of the weigh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2015
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2015/297392